Locality-sensitive hashing - PDFSEARCH.IO - Document Search Engine

Locality-sensitive hashing
Results: 117

#	Item
1	Introduction to Locality-Sensitive Hashing Tyler NeylonFormats: html \| pdf \| kindle pdf] Locality-sensitive hashing (LSH) is a set of techniques that Add to Reading List Source URL: tylerneylon.com Language: English - Date: 2018-09-18 19:56:28 Information retrieval Hashing Information science Search algorithms Locality-sensitive hashing Hash function Hash table Cryptographic hash function Hash list MinHash RabinKarp algorithm
2	Sieving for shortest vectors in lattices using (angular) locality-sensitive hashing Thijs Laarhoven http://www.thijs.com/ Add to Reading List Source URL: thijs.com Language: English - Date: 2015-08-18 13:30:19
3	LSH - Locality Sensitive Hashing Big Data: tecnologie, metodologie e applicazioni per l’analisi dei dati massivi Ministero Dello Sviluppo Economico Istituto Superiore delle Comunicazioni e delle Tecnologie dell’Info Add to Reading List Source URL: www.isticom.it Language: Italian - Date: 2017-04-14 08:37:39
4	Approximate Nearest Neighbors Search in High Dimensions and Locality-Sensitive Hashing PAPERS Piotr Indyk, Rajeev Motwani: Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality, STOC 1998. Add to Reading List Source URL: graphics.stanford.edu - Date: 2006-11-08 20:45:04
5	Locality-Sensitive Hashing Scheme Based on p-Stable Distributions Mayur Datar Department of Computer Science, Stanford University Add to Reading List Source URL: graphics.stanford.edu - Date: 2006-09-18 17:56:26
6	N OTES ON LOCALITY SENSITIVE HASHING WITH p- STABLE DISTRIBUTIONS Add to Reading List Source URL: cseweb.ucsd.edu - Date: 2007-02-14 21:05:30
7	Beyond Locality Sensitive Hashing Alex Andoni (Microsoft Research) Joint with: Piotr Indyk (MIT), Huy L. Nguyen (Princeton), Ilya Raz Add to Reading List Source URL: mmds-data.org - Date: 2014-07-08 21:55:14
8	Algorithms and Data Structures Winter TermExercises for UnitLet U = {0, 1, . . . , K − 1}, let p ≥ K be a prime number, and let 0 < t < K. For 0 ≤ a, b < p define Add to Reading List Source URL: www-tcs.cs.uni-sb.de Language: English - Date: 2016-03-06 16:06:05 Information retrieval Search algorithms Information science Hashing Cryptographic hash functions Error detection and correction Hash function Hash table Universal hashing Locality-sensitive hashing
9	CSE 584A Class 24 Jeremy Buhler April 20, 2016 1 Add to Reading List Source URL: classes.engineering.wustl.edu Language: English - Date: 2016-04-22 15:32:46 Search algorithms Information science Information retrieval Hashing Error detection and correction Hash function Hash table BLAST Locality-sensitive hashing Bloom filter

UPDATE